翻訳と辞書 Words near each other ・ Haseo ・ Haseolsan ・ Haseri Asli ・ Haserich ・ Hasetsukabe no Koharumaru ・ Hasetsune Cup ・ Hasfield ・ Hasfield Court ・ Hasford ・ Hasford Heights, California ・ Hasgebe, Serik ・ Hasguard ・ Hash ・ Hash (food) ・ Hash (Unix) ・ Hash array mapped trie ・ Hash Bash ・ Hash BioTech Labs ・ Hash browns ・ Hash buster ・ Hash cakes ・ Hash calendar ・ Hash chain ・ Hash Code cracker ・ Hash consing ・ Hash filter ・ Hash function ・ Hash function security summary ・ Hash House ・ Hash House a go go Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Hash array mapped trie ： ウィキペディア英語版 Hash array mapped trie A hash array mapped trie〔 (HAMT) is an implementation of an associative array that combines the characteristics of a hash table and an array mapped trie. It is a refined version of the more general notion of a hash tree. == Operation == A HAMT is an array mapped trie where the keys are first hashed in order to ensure an even distribution of keys and a constant key length. In a typical implementation of HAMT's array mapped trie, each node contains a table with some fixed number N of slots with each slot containing either a nil pointer or a pointer to another node. N is commonly 32. As allocating space for N pointers for each node would be expensive, each node instead contains a bitmap which is N bits long where each bit indicates the presence of a non-nil pointer. This is followed by an array of pointers equal in length to the number of ones in the bitmap, (its Hamming weight). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hash array mapped trie」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.